Graph Grammars and Operational Semantics
نویسنده
چکیده
Transformations of graphlike expressions are called correct if they preserve a given functional semantics of the expressions. Combining the algebraic theories of graph grammars (cf. [lo]) and programming language semantics (cf. [l]) it will be proved that the correctness of transformation rules carries over to the correctness of derivations via such rules. Applying this result to LISP we show that a LISP interpreter represented by a graph grammar is correct with respect to the functional semantics of graphlike LISP expressions.
منابع مشابه
Processing Causal Block Diagrams with Graph Grammars in AToM3
AToM3 is a tool which supports multi-formalism modelling and metamodelling to facilitate computer assisted analysis and design of complex systems. To enable the automatic generation of modelling tools, the formalisms themselves are modelled at a meta-level within an appropriate meta-formalism. The generated tools are able to process (create, edit, simulate,... ) models expressed in the correspo...
متن کاملGraph Interpolation Grammars: a Rule-based Approach to the Incremental Parsing of Natural Languages
Graph Interpolation Grammars are a declarative formalism with an operational semantics. Their goal is to emulate salient features of the human parser, and notably incrementality. The parsing process defined by GIGs incrementally builds a syntactic representation of a sentence as each successive lexeme is read. A GIG rule specifies a set of parse configurations that trigger its application and a...
متن کاملOverview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation
In this paper we give an overview of formal concepts for model transformations between visual languages based on typed attributed graph transformation. We start with a basic concept where visual languages are defined by attributed type graphs only and model transformations by basic typed attributed graph transformation systems. We continue with different kinds of extensions of the basic concept...
متن کاملIntegrating the Speci cation Techniques ofGraph Transformation and Temporal Logic ?
The aim of this paper is an integration of graph grammars with diierent kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic semantics of graph transformation systems is not able to express constrained behaviour we introduce-in analogy to other approaches-a coalgebraic semantics which associates with each system a category of models (determi...
متن کاملAn Operational Semantics for UML 2 Sequence Diagrams Supported by Model Transformations
In this paper, we propose an operational semantics for UML2SD (Unified Modeling Language 2 Sequence Diagrams) to its equivalent Büchi automaton. The objective of this paper is twofold; first we provide UML2SD with Büchi automaton formal semantics, and second we bridge the gap between theoretic studies to practical studies by improving model transformations. The approach is based on Algebraic gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 19 شماره
صفحات -
تاریخ انتشار 1978